Fast and RIP-Optimal Transforms
نویسندگان
چکیده
منابع مشابه
Fast and RIP-optimal transforms
We study constructions of k×n matrices A that both (1) satisfy the restricted isometry property (RIP) at sparsity s with optimal parameters, and (2) are efficient in the sense that only O(n log n) operations are required to compute Ax given a vector x. Our construction is based on repeated application of independent transformations of the form DH , where H is a Hadamard or Fourier transform and...
متن کاملOptimal Congestion Control with Multipath Routing Using TCP-FAST and a Variant of RIP
This paper discusses an optimization-based approach for congestion control together with multipath routing in a TCP/IP network. In recent research we have shown how natural optimization problems for resource allocation can be solved in decentralized way across a network, by traffic sources adapting their rates and routers adapting their traffic splits, all using a common congestion measure. We ...
متن کاملFast Modular Transforms
It is shown that if division and multiplication in a Euclidean domain can be performed in O(N log ~ N) steps, then the residues of an N precision element in the domain can be computed in O(N log a+l N) steps. A special case of this result is that the residues of an N precision integer can be computed in O(N logS N log log N) total operations. Using a polynomial division algorithm due to Strasse...
متن کاملFast linear canonical transforms.
The linear canonical transform provides a mathematical model of paraxial propagation though quadratic phase systems. We review the literature on numerical approximation of this transform, including discretization, sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande-Tukey fast Fourier tran...
متن کاملFast Fourier Transforms
29 O(b log(b)) operations (using standard multiplication). As there are O(b= log(b)) primes in total, the running time of this stage of the algorithm is O(b 2 L), even using the \grammar school" method of integer multiplication. At this stage of the algorithm we have obtained a vector of length L whose entries are integral linear combinations of powers of with coeecients bounded by M in absolut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2014
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-014-9632-3